Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(0) |
→ cons(0) |
| 2: |
|
f(s(0)) |
→ f(p(s(0))) |
| 3: |
|
p(s(0)) |
→ 0 |
|
There are 2 dependency pairs:
|
| 4: |
|
F(s(0)) |
→ F(p(s(0))) |
| 5: |
|
F(s(0)) |
→ P(s(0)) |
|
The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.
Tyrolean Termination Tool (0.00 seconds)
--- May 4, 2006